Formalizing Con guration Knowledge Using Rules with Choices
نویسنده
چکیده
This paper studies the formal underpinnings of the product connguration problem. A rule-based language is proposed for expressing typical forms of knowledge interactions in connguration models, i.e. choices, dependencies between choices, optionality and defaults. The language is equipped with a declarative semantics that provides formal deenitions for the main concepts in product connguration, i.e., connguration model, customer requirements, satissability of requirements and validity of a connguration. A key feature is that the semantics ensures that valid conngurations are tightly grounded in the connguration rules by employing Horn clause derivability but without resorting to an explicit minimality condition on conngu-rations. This type of groundedness has not been considered in previous work on product connguration. Avoiding minimality conditions has a favorable eeect on the complexity of the connguration tasks. For example , the validity of a connguration as well as satissability of requirements can be decided in polynomial time and also other computational task remain in NP. The semantics of the rule-based language is shown to be closely related to the stable model semantics of normal logic programs and the possible model semantics of disjunctive programs. It is argued that from a knowledge representation point of view the rule-based language is more attractive for representing connguration knowledge than propositional logic or constraints.
منابع مشابه
Conceptual Modeling for Con®guration of Mass-customizable Products
The development and maintenance of product con®guration systems is faced with increasing challenges caused by the growing complexity of the underlying knowledge bases. Effective knowledge acquisition is needed since the product and the corresponding con®guration system have to be developed in parallel. In this paper, we show how to employ a standard design language (Uni®ed Modeling Language, UM...
متن کاملIntegration of Distributed Constraint-Based Con gurators
Con guration problems are a thriving application area for declarative knowledge representation that experiences a constant increase in size and complexity of knowledge bases. However, today's con gurators are designed for solving local con guration problems not providing any distributed con guration problem solving functionality. Consequently the challenges for the construction of con guration ...
متن کاملAn axiomatization of success
In this paper we give an axiomatic characterization of three families of measures of success de ned by Laruelle and Valenciano (2005) for voting rules. Key words: collective decision-making, voting rules, axiomatization 1. Introduction The aim of this paper is to provide an axiomatization of the measures of success in voting rules. We look for a set of axioms, that is, assumptions that, whateve...
متن کاملConstruction of problem-solving methods as parametric design
The knowledge-engineering literature contains a number of approaches for constructing or selecting problem solvers. Some of these approaches are based on indexing and selecting a problem solver from a library, others are based on a knowledge acquisition process, yet others are based on search-strategies. None of these approaches sees constructing a problem solver as a con guration task that cou...
متن کامل